Nuprl Lemma : valid-sys_wf 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)), e:E(Sys).
valid-sys(es;Config;Sys;e  
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), EState(T), a:A fp B(a), f(a), Id, , strong-subtype(A;B), P  Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(Epred?info), kindcase(ka.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , b, constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,yt(x;y), Void, x:A.B(x), Top, S  T, suptype(ST), first(e), A, <ab>, pred(e), x.A(x), xt(x), P & Q, chain_config(), E, ES, AbsInterface(A), chain_sys(Cmd), e  X, {x:AB(x)} , E(X), Atom$n, let x,y = A in B(x;y), t.1, loc(e), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , X(e), ccpred?(x), ccpred-id(x), (e <loc e'), (e < e'), ff, inr x , "$token", tt, inl x , Atom, True, False, A c B, e<e'P(e), e<e'.P(e), x:AB(x), cchead?(x), ccsucc?(x), cctail?(x), P  Q, chain_sys_ind(x;cmd.input(cmd);from,cmds.update(from;cmds)), valid-sys(es;Config;Sys;e)
Lemmaschain sys ind wf, cchead? wf, cctail? wf, ccsucc? wf, existse-before wf, ccpred-id wf, alle-lt wf, es-locl wf, false wf, true wf, btrue wf, bfalse wf, ccpred? wf, es-interface-val wf, es-interface wf, es-interface-val wf2, event system wf, es-loc wf, es-E-interface wf, es-is-interface wf, chain sys wf, es-E wf, chain config wf, deq wf, EOrderAxioms wf, kind wf, Msg wf, nat wf, val-axiom wf, cless wf, qle wf, bool wf, Knd wf, kindcase wf, IdLnk wf, constant function wf, loc wf, not wf, assert wf, first wf, top wf, unit wf, pred! wf, strongwellfounded wf, member wf, rationals wf, Id wf, EState wf, subtype rel wf

origin